package com.mingdao.lhy.util;

public class Validate {

	public static boolean isSfzhOk(String sfzh) {
		if (18 != sfzh.length()) {
			return false;
		}
		if (!checkId(sfzh)) {
			return false;
		}
		if (!verForm(sfzh)) {
			return false;
		}
		if (!verify(sfzh.toCharArray())) {
			return false;
		}
		return true;
	}

	public static boolean isXueJiHaoOk(String xjh) {
		return true;
	}

	public static boolean isMingZuOk(String minzu) {
		return true;
	}

	public static boolean isSexOk(String sex) {
		return true;
	}

	// 身份证校验
	public static boolean checkId(String id) {
		char[] ch = id.toCharArray();
		boolean flag1 = verForm(id);
		boolean flag2 = verify(ch);
		if (flag1 == true && flag2 == true) {
			return true;
		}
		return false;
	}

	// <------------------身份证格式的正则校验----------------->
	public static boolean verForm(String num) {
		String reg = "^\\d{15}$|^\\d{17}[0-9Xx]$";
		if (!num.matches(reg)) {
			return false;
		}
		return true;
	}

	// <------------------身份证最后一位的校验算法----------------->
	public static boolean verify(char[] id) {
		int sum = 0;
		int w[] = { 7, 9, 10, 5, 8, 4, 2, 1, 6, 3, 7, 9, 10, 5, 8, 4, 2 };
		char[] ch = { '1', '0', 'X', '9', '8', '7', '6', '5', '4', '3', '2' };
		for (int i = 0; i < id.length - 1; i++) {
			sum += (id[i] - '0') * w[i];
		}
		int c = sum % 11;
		char code = ch[c];
		char last = id[id.length - 1];
		last = last == 'x' ? 'X' : last;
		return last == code;
	}
	
    //正则表达式   :   完美
	public static boolean isNumber(String str){
		String reg = "^[0-9]+(.[0-9]+)?$";
		return str.matches(reg);
	}
}
